Algebra of Normal Function Tables
نویسنده
چکیده
In contrast to classical algebra and analysis the functions encountered in computer science are usually piecewise continuous functions or functions whose evaluation rules change dramatically depending on a subset of the input values. Because of the pervasiveness of the if-then-else construction in programming, we have to extend classical mathematical methods to handle this kind of object. We approach this class of functions using tabular expressions. In this paper we de ne a function algebra, over a many sorted algebra, which is closed under composition. Then, this function algebra is extended to tables. This enables us to de ne the composition of tables. We show that this algebra of tables is closed under composition. We give two algorithms to compute the composition of tables.
منابع مشابه
A Linear Algebra Method for Solving Systems of Algebraic Equations
We consider the exact computation of matrix eigenproblems in residue class rings for solving systems of algebraic equations. We construct multiplication tables using a Gröbner basis of a zero-dimensional ideal. Then, we analyze the tables by exactly computing their Frobenius normal forms. The derogatoriness and the diagonalizability are determined by the normal forms, and the problem is divided...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملTHE DUALITY OF THE L?-REPRESENTATION ALGEBRA ?(S ) OF A FOUNDATION SEMIGROUP S AND FUNCTION ALGEBRAS
In the present paper for a large family of topological semigroups, namely foundation semigroups, for which topological groups and discrete semigroups are elementary examples, it is shown that ?(S) is the dual of a function algebra.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997